A constant conflict

Constant Weight Conflict-Avoiding Codes

A conflict-avoiding code (CAC) C of length n with weight k is a family of binary sequences of length n and weight k satisfying ∑ 0≤t≤n−1 xitxj,t+s ≤ 1 for any distinct codewords xi = (xi0, xi1, . . . , xi,n−1) and xj = (xj0, xj1, . . . , xj,n−1) in C and for any integer s, where the subscripts are taken modulo n. A CAC with maximal code size for given n and k is said to be optimal. A CAC has be...

Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs

We study the algorithmic problem of coordinating transmissions in a wireless network where radio interference constrains concurrent transmissions on wireless links. We focus on pairwise conflicts between the links; these can be described as a conflict graph. Associated with the conflict graph are two fundamental network coordination tasks: (a) finding a nonconflicting set of links with the maxi...

A tight asymptotic bound on the size of constant-weight conflict-avoiding codes

In the study of multiple-access in the collision channel, conflict-avoiding code is used to guarantee that each transmitting user can send at least one packet successfully in the worst case within a fixed period of time, provided that at most k users out of M potential users are active simultaneously. The number of codewords in a conflict-avoiding code determines the number of potential users t...

Hypersurfaces with Constant Mean Curvature in a Lorentzian Space Form

Proposal for a Constant Cosmological Constant

It is proposed that the apparent positive acceleration of the cosmological scale factor is due to the vacuum energy of an incomplete chiral phase transition in a hidden SU(2) sector. Constraints from primordial nucleosynthesis imply that the present metastable phase is in a substantially supercooled state. It is argued that massless chiral condensates can substantially enhance the possibility o...